Pansharpening Via Neighbor Embedding of Spatial Details
نویسندگان
چکیده
منابع مشابه
An algorithm for L1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on 2 distance. Here we develop an approach for 1 distance that begins with an explicit and exactly distance-preserving embedding of the points into 2. We show how this can efficiently be combined with random-projection based methods for 2 NN search, such as locality-sensitive hashing (LSH) or random projection trees. We...
متن کاملAn algorithm for `1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on `2 distance. Here we develop an approach for `1 distance that begins with an explicit and exactly distance-preserving embedding of the points into `2. We show how this can efficiently be combined with random-projection based methods for `2 NN search, such as locality-sensitive hashing (LSH) or random projection trees...
متن کاملHierarchical Stochastic Neighbor Embedding
In recent years, dimensionality-reduction techniques have been developed and are widely used for hypothesis generation in Exploratory Data Analysis. However, these techniques are confronted with overcoming the trade-off between computation time and the quality of the provided dimensionality reduction. In this work, we address this limitation, by introducing Hierarchical Stochastic Neighbor Embe...
متن کاملStochastic Neighbor Embedding
We describe a probabilistic approach to the task of placing objects, described by high-dimensional vectors or by pairwise dissimilarities, in a low-dimensional space in a way that preserves neighbor identities. A Gaussian is centered on each object in the high-dimensional space and the densities under this Gaussian (or the given dissimilarities) are used to define a probability distribution ove...
متن کاملOptimization Equivalence of Divergences Improves Neighbor Embedding
Visualization methods that arrange data objects in 2D or 3D layouts have followed two main schools, methods oriented for graph layout and methods oriented for vectorial embedding. We show the two previously separate approaches are tied by an optimization equivalence, making it possible to relate methods from the two approaches and to build new methods that take the best of both worlds. In detai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
سال: 2021
ISSN: 1939-1404,2151-1535
DOI: 10.1109/jstars.2021.3067877